Cryptanalysis of Polynominal Authentication and Signature Scheme
نویسندگان
چکیده
Polynomial Authentication and Signature Scheme (PASS) is a new public key authentication and signature scheme proposed by NTRU Cryptosystems Inc. It is based on the hard problems related to constrained polynomial evaluation. In this paper, we break PASS with the proposed parameters. We show how to forge valid authentication transcripts or digital signatures in PASS with knowledge of the public key only and without knowing any previous authentication transcripts or signatures.
منابع مشابه
An ECC-Based Mutual Authentication Scheme with One Time Signature (OTS) in Advanced Metering Infrastructure
Advanced metering infrastructure (AMI) is a key part of the smart grid; thus, one of the most important concerns is to offer a secure mutual authentication. This study focuses on communication between a smart meter and a server on the utility side. Hence, a mutual authentication mechanism in AMI is presented based on the elliptic curve cryptography (ECC) and one time signature (OTS) consists o...
متن کاملGame-Based Cryptanalysis of a Lightweight CRC-Based Authentication Protocol for EPC Tags
The term "Internet of Things (IoT)" expresses a huge network of smart and connected objects which can interact with other devices without our interposition. Radio frequency identification (RFID) is a great technology and an interesting candidate to provide communications for IoT networks, but numerous security and privacy issues need to be considered. In this paper, we analyze the security and ...
متن کاملCryptanalysis of an Efficient Deniable Authentication Protocol Based on Generalized ElGamal Signature Scheme
In 1998, Dwork et al. first proposed an application of zeroknowledge, deniable authentication protocol. Thereafter, there were many researches about the deniable authentication schemes. In 2004, Shao demonstrated out that the previous schemes had a common weakness in which any third party can impersonate the intended receiver to verify the signature of the given message, and they proposed a new...
متن کاملCryptanalysis of Li et al.’s Proxy Signature Scheme
This work shows that the security improvement of Li et al. for Park and Lee’s nominative proxy signature scheme is still insecure against the original signer’s forgery. The problem within Li et al. scheme is that the verifier cannot judge the correctness of the parameter generated by the original signer from the received signature. Key-Words: digital signature, authentication, hash function, di...
متن کاملConvertible limited (multi-) verifier signature: new constructions and applications
A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...
متن کامل